The Origin-Destination Shortest Path Problem
نویسنده
چکیده
In this paper we consider the Origin-Destination (O-D) shortest path problem. We define the O-D shortest path problem as follows: We are given the set of nodes and edges in a network. Associated with each edge is a weight. In addition, we are given two subsets of the node set. One set is called the set of origin nodes and the other is called the set of destination nodes. The objective of the O-D shortest path problem is to determine the shortest path between every node in the set of origin nodes and every node in the set of destination nodes. This problem generalizes several traditional shortest path problems and has applications in transportation and communication networks. We develop two algorithms for this problem and analyse the average case running time of these algorithms.
منابع مشابه
The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملDeveloping Passenger Hub Location Problem Based on Origin-Destination Trips Derived by Gravity Model (Case Study of Iran's Rail Network)
Iran’s geographical situation, in particular long-distance routes, makes rail transportation to be more attractive and important than the other modes. Since transport cost is the main concern for local and national authorities, Hub location is an important problem in transport planning in which transport industries are looking for selected points to change trains for passengers. In this pap...
متن کاملAn Inverse Shortest Path Problem on an Uncertain Graph
The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can b...
متن کاملFinding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملParallel Shortest Path Auction Algorithmsl
In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of prob...
متن کامل